About weak connectivity

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reasoning about Connectivity Constraints

Many problems in computational sustainability involve constraints on connectivity. When designing a new wildlife corridor, we need it to be geographically connected. When planning the harvest of a forest, we need new areas to harvest to be connected to areas that have already been harvested so we can access them easily. And when town planning, we need to connect new homes to the existing utilit...

متن کامل

Weak and strong kk-connectivity games

For a positive integer k we consider the k-vertex-connectivity game, played on the edge set of Kn, the complete graph on n vertices. We first study the Maker-Breaker version of this game and prove that, for any integer k ≥ 2 and sufficiently large n, Maker has a strategy to win this game within bkn/2c+1 moves, which is easily seen to be best possible. This answers a question from [6]. We then c...

متن کامل

Reasoning about connectivity without paths

In graph theory connectivity is stated, prevailingly, in terms of paths. While exploiting a proof assistant to check formal reasoning about graphs, we chose to work with an alternative characterization of connectivity: for, within the framework of the underlying set theory, it requires virtually no preparatory notions. We say that a graphs devoid of isolated vertices is connected if no subset o...

متن کامل

Making connections about brain connectivity.

The Functional Brain Connectivity workshop was organized by Rolf Kötter and Karl Friston, and held in Düsseldorf, Germany, on 4-6 April, 2002.

متن کامل

Weak Connectivity in (Un)bounded Dependency Constructions

This paper argues that various kinds of displaced structures in English should be licensed by a more explicitly formulated type of rule schema in order to deal with what is called weak connectivity in English. This paper claims that the filler and the gap site cannot maintain the total identity of features but a partial overlap since the two positions need to obey the structural forces that com...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 1997

ISSN: 0012-365X

DOI: 10.1016/s0012-365x(96)00203-8